Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(id, x) -> x
app2(plus, 0) -> id
app2(app2(plus, app2(s, x)), y) -> app2(s, app2(app2(plus, x), y))

Q is empty.


↳ QTRS
  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(id, x) -> x
app2(plus, 0) -> id
app2(app2(plus, app2(s, x)), y) -> app2(s, app2(app2(plus, x), y))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(id, x) -> x
app2(plus, 0) -> id
app2(app2(plus, app2(s, x)), y) -> app2(s, app2(app2(plus, x), y))

The set Q consists of the following terms:

app2(id, x0)
app2(plus, 0)
app2(app2(plus, app2(s, x0)), x1)


Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(app2(plus, app2(s, x)), y) -> APP2(s, app2(app2(plus, x), y))
APP2(app2(plus, app2(s, x)), y) -> APP2(app2(plus, x), y)
APP2(app2(plus, app2(s, x)), y) -> APP2(plus, x)

The TRS R consists of the following rules:

app2(id, x) -> x
app2(plus, 0) -> id
app2(app2(plus, app2(s, x)), y) -> app2(s, app2(app2(plus, x), y))

The set Q consists of the following terms:

app2(id, x0)
app2(plus, 0)
app2(app2(plus, app2(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(plus, app2(s, x)), y) -> APP2(s, app2(app2(plus, x), y))
APP2(app2(plus, app2(s, x)), y) -> APP2(app2(plus, x), y)
APP2(app2(plus, app2(s, x)), y) -> APP2(plus, x)

The TRS R consists of the following rules:

app2(id, x) -> x
app2(plus, 0) -> id
app2(app2(plus, app2(s, x)), y) -> app2(s, app2(app2(plus, x), y))

The set Q consists of the following terms:

app2(id, x0)
app2(plus, 0)
app2(app2(plus, app2(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 1 SCC with 2 less nodes.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP
              ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(plus, app2(s, x)), y) -> APP2(app2(plus, x), y)

The TRS R consists of the following rules:

app2(id, x) -> x
app2(plus, 0) -> id
app2(app2(plus, app2(s, x)), y) -> app2(s, app2(app2(plus, x), y))

The set Q consists of the following terms:

app2(id, x0)
app2(plus, 0)
app2(app2(plus, app2(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


APP2(app2(plus, app2(s, x)), y) -> APP2(app2(plus, x), y)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
APP2(x1, x2)  =  APP1(x1)
app2(x1, x2)  =  app2(x1, x2)
plus  =  plus
s  =  s
0  =  0
id  =  id

Lexicographic Path Order [19].
Precedence:
APP1 > [app2, id]
APP1 > plus


The following usable rules [14] were oriented:

app2(plus, 0) -> id



↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP
              ↳ QDPOrderProof
                ↳ QDP
                  ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(id, x) -> x
app2(plus, 0) -> id
app2(app2(plus, app2(s, x)), y) -> app2(s, app2(app2(plus, x), y))

The set Q consists of the following terms:

app2(id, x0)
app2(plus, 0)
app2(app2(plus, app2(s, x0)), x1)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.